13 research outputs found

    Cooperative Scheduling of Bag-of-Tasks Workflows on Hybrid Clouds

    Get PDF
    We address the problem of scheduling a class of large-scale applications inspired from real-world on hybrid Clouds, characterized by a large number of homogeneous and concurrent tasks that are the main sources of bottlenecks but open great potential for optimization. We formulate the scheduling problem as a new sequential cooperative game and propose a communication- and storage-aware multi-objective algorithm that optimizes two user objectives (execution time and economic cost) while fulfilling two constraints (network bandwidth and storage requirements). We present comprehensive experiments using both simulation and real-world applications that demonstrate the efficiency and effectiveness of our approach in terms of algorithm complexity, make span, cost, system-level efficiency, fairness, and other aspects compared with other related algorithms.(VLID)2217955Accepted versio

    Cooperative Scheduling of Bag-of-Tasks Workflows on Hybrid Clouds

    Get PDF
    We address the problem of scheduling a class of large-scale applications inspired from real-world on hybrid Clouds, characterized by a large number of homogeneous and concurrent tasks that are the main sources of bottlenecks but open great potential for optimization. We formulate the scheduling problem as a new sequential cooperative game and propose a communication- and storage-aware multi-objective algorithm that optimizes two user objectives (execution time and economic cost) while fulfilling two constraints (network bandwidth and storage requirements). We present comprehensive experiments using both simulation and real-world applications that demonstrate the efficiency and effectiveness of our approach in terms of algorithm complexity, make span, cost, system-level efficiency, fairness, and other aspects compared with other related algorithms.(VLID)2217955Accepted versio

    A Sequential Cooperative Game Theoretic Approach to Scheduling Multiple Large-scale Applications in Grids

    No full text
    Scheduling large-scale applications in heterogeneous distributed computing systems is a fundamental NP-complete problem that is critical to obtaining good performance and execution cost. In this paper, we address the scheduling problem of an important class of large-scale Grid applications inspired by the real world, characterized by a huge number of homogeneous, concurrent, and computationally intensive tasks that are the main sources of performance, cost, and storage bottlenecks. We propose a new formulation of this problem based on a cooperative distributed game-theory-based method applied using three algorithms with low time complexity for optimizing three important metrics in scientific computing: execution time, economic cost, and storage requirements. We present comprehensive experiments using simulation and real-world applications that demonstrate the effectiveness of our approach in terms of time and fairness compared to other related algorithms.(VLID)2202652Accepted versio

    Multi-Objective Game Theoretic Scheduling of Bag-of-Tasks Workflows on Hybrid Clouds

    No full text
    Scheduling multiple large-scale parallel workflow applications on heterogeneous computing systems like hybrid clouds is a fundamental NP-complete problem that is critical to meeting various types of QoS (Quality of Service) requirements. This paper addresses the scheduling problem of large-scale applications inspired from real-world, characterized by a huge number of homogeneous and concurrent bags-of-tasks that are the main sources of bottlenecks but open great potential for optimization. The scheduling problem is formulated as a new sequential cooperative game and propose a communication and storage-aware multi-objective algorithm that optimizes two user objectives (execution time and economic cost) while fulfilling two constraints (network bandwidth and storage requirements). We present comprehensive experiments using both simulation and real-world applications that demonstrate the efficiency and effectiveness of our approach in terms of algorithm complexity, makespan, cost, system-level efficiency, fairness, and other aspects compared with other related algorithms.(VLID)2202656Submitted versio

    Incomunicación cultural y poder innovador

    Get PDF
    Considera que hay gran incomunicación en la vida cultural de Euskadi y que el populismo cultural que se intenta imponer no beneficia a la obra de altura intelectual. Hay una ausencia de polémica cultural, de controversia ideológica cultural y una escasa valoración de los escritores, pensadores e intelectuales. Presenta el ejemplo del libro de Krutwig "Computer shock. Vasconia. Año 2001", que no ha tenido ningún eco en EuskadiThe author considers that there is a great deal of incommunication in the cultural life of the Basque Country and that cultural populism that he attempts to impose does not benefit a work of intellectual category. There is an absence of cultural polemics, of ideological and cultural controversy and a scarce appreciation of writers, thinkers and intellectuals. The author introduces the example of the book by Krutwig "Computer shock. Vasconia. 2001", that it has not had any echo whatsoever in the Basque Countr

    Data and manucript (V1)

    No full text

    Cardiac image segmentation by random walks with dynamic shape constraint

    No full text
    The quantitative analysis of the left ventricle (LV) contractile function is one of the key steps in the assessment of cardiovascular disease. Such analysis greatly depends on the accurate delineation of LV boundary from cardiac sequences. However, segmentation of the LV still remains a challenging problem due to its subtle boundary, occlusion, and image inhomogeneity. To overcome such difficulties, the authors propose a novel segmentation method by incorporating a dynamic shape constraint into the weighting function of the random walks segmentation algorithm. This approach involves iterative updates on the intermediate result to achieve the desired solution. The inclusion of a shape constraint restricts the solution space of the segmentation result to handle misleading information that may come from noise, weak boundaries and clutter, leading to increased robustness of the algorithm. The authors describe the details of the proposed method and demonstrate its effectiveness in segmenting the LV from real cardiac magnetic resonance (CMR) image sets. The experimental results demonstrate that the proposed method obtains better segmentation performance than the standard method

    The lupus autoantigen La/Ssb is an Xist-binding protein involved in Xist folding and cloud formation

    No full text
    Using the programmable RNA-sequence binding domain of the Pumilio protein, we FLAG-tagged Xist (inactivated X chromosome specific transcript) in live mouse cells. Affinity pulldown coupled to mass spectrometry was employed to identify a list of 138 candidate Xist-binding proteins, from which, Ssb (also known as the lupus autoantigen La) was validated as a protein functionally critical for X chromosome inactivation (XCI). Extensive XCI defects were detected in Ssb knockdown cells, including chromatin compaction, death of female mouse embryonic stem cells during in vitro differentiation and chromosome-wide monoallelic gene expression pattern. Live-cell imaging of Xist RNA reveals the defining XCI defect: Xist cloud formation. Ssb is a ubiquitous and versatile RNA-binding protein with RNA chaperone and RNA helicase activities. Functional dissection of Ssb shows that the RNA chaperone domain plays critical roles in XCI. In Ssb knockdown cells, Xist transcripts are unstable and misfolded. These results show that Ssb is critically involved in XCI, possibly as a protein regulating the in-cell structure of Xist.Ministry of Education (MOE)Ministry of Health (MOH)National Research Foundation (NRF)Published versionL.C. was supported by the National Key R&D Program of China [2018YFC1313003, 2018YFA0107002]; National Natural Science Foundation of China [31871485]; Natural Science Foundation of Tianjin [18JCJQJC48400]; 111 Project Grant [B08011]; Fundamental Research Funds for the Central Universities; L.-F.Z. was supported by Singapore Ministry of Education Academic Research Fund [MOE2015-T2-1-093]; Singapore National Research Foundation under its Cooperative Basic Research Grant administered by the Singapore Ministry of Health’s National Medical Research Council [NMRC/CBRG/0092/2015]. Funding for open access charge: the National Key R&D Program of China [2018YFA0107002]
    corecore